Prime Numbers in Certain Arithmetic Progressions
نویسندگان
چکیده
We discuss to what extent Euclid’s elementary proof of the infinitude of primes can be modified so as to show infinitude of primes in arithmetic progressions (Dirichlet’s theorem). Murty had shown earlier that such proofs can exist if and only if the residue class (mod k ) has order 1 or 2. After reviewing this work, we consider generalizations of this question to algebraic number fields.
منابع مشابه
Strings of Special Primes in Arithmetic Progressions
The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves that there exist arbitrarily long strings of consecutive primes that lie in any arithmetic progression that contains infinitely many primes. Using the technique...
متن کاملOn Elementary Proofs of the Prime Number Theorem for Arithmetic Progressions, without Characters
We consider what one can prove about the distribution of prime numbers in arithmetic progressions, using only Selberg's formula. In particular, for any given positive integer q, we prove that either the Prime Number Theorem for arithmetic progressions, modulo q, does hold, or that there exists a subgroup H of the reduced residue system, modulo q, which contains the squares, such that (x; q; a) ...
متن کاملThe Distribution of Smooth Numbers in Arithmetic Progressions
We say that a number n is y-smooth if all the prime factors of n lie below y. Let S(y) denote the set of all y-smooth numbers, and let S(x, y) denote the set of y-smooth numbers below x. Let Ψ(x, y) denote the number of smooth integers below x; thus Ψ(x, y) is the cardinality of S(x, y). In this note we consider the distribution of smooth numbers among arithmetic progressions a (mod q). We supp...
متن کاملOn Carmichael numbers in arithmetic progressions
Assuming a weak version of a conjecture of Heath-Brown on the least prime in a residue class, we show that for any coprime integers a and m > 1, there are infinitely many Carmichael numbers in the arithmetic progression a mod m.
متن کاملPrimes in arithmetic progression
Prime numbers have fascinated people since ancient times. Since the last century, their study has acquired importance also on account of the crucial role played by them in cryptography and other related areas. One of the problems about primes which has intrigued mathematicians is whether it is possible to have long strings of primes with the successive primes differing by a fixed number, namely...
متن کامل